Quantum Collision-Resistance of Non-uniformly Distributed Functions: Upper and Lower Bounds
نویسندگان
چکیده
We study the quantum query complexity of finding a collision for a function f whose outputs are chosen according to a non-uniform distribution D. We derive some upper bounds and lower bounds depending on the min-entropy and the collision-entropy of D. In particular, we improve the previous lower bound in [TTU16] from Ω(2) to Ω(2) where k is the min-entropy of D.
منابع مشابه
Quantum Collision-Resistance of Non-uniformly Distributed Functions
We study the quantum query complexity of finding a collision for a function f whose outputs are chosen according to a distribution with min-entropy k. We prove that Ω(2) quantum queries are necessary to find a collision for function f . This is needed in some security proofs in the quantum random oracle model (e.g. Fujisaki-Okamoto transform).
متن کاملMeasuring Insecurity of Programs
Recent advances in the theory and practice of quantitative information flow analysis allow, for the first time, to compute good approximations of security leaks of non-trivial programs. This paper presents a tool for a dynamic analysis of security leaks in programs. The tool first computes the precise leakage for a subset of the program inputs within a user-specified time. After exceeding this ...
متن کاملQuantum Collision-Finding in Non-uniform Random Functions
We study quantum attacks on finding a collision in a nonuniform random function whose outputs are drawn according to a distribution of min-entropy k. This can be viewed as showing generic security of hash functions under relaxed assumptions in contrast to the standard heuristic of assuming uniformly random outputs. It is useful in analyzing quantum security of the Fujisaki-Okamoto transformatio...
متن کاملRevised: Block Cipher Based Hash Function Construction From PGV
Preneel, Govaerts, and Vandewalle[12] considered the 64 most basic ways to construct a hash function from a block cipher, and regarded 12 of these 64 schemes as secure. Black, Pogaway and Shrimpton[3] proved that, in black-box model, the 12 schemes that PGV singled out as secure really are secure and given tight upper and lower bounds on their collision resistance. And also they pointed out, by...
متن کاملDistributed Sensing and Transmission of Sporadic Random Samples in a Multiple-Access Channel
1 This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a network of sensors and transmitted with finite energy to a common receiver via an additive white Gaussian noise asynchronous multiple-access channel. Transmis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017